Revisiting Decomposition by Clique Separators
نویسندگان
چکیده
منابع مشابه
Vertical Decomposition of a Lattice Using Clique Separators
A concept (or Galois) lattice is built on a binary relation; this relation can be represented by a bipartite graph. We explain how we can use the graph tool of clique minimal separator decomposition to decompose some bipartite graphs into subgraphs in linear time; each subgraph corresponds to a subrelation. We show that the lattices of these subrelations easily yield the lattice of the global r...
متن کاملDecomposition by maxclique separators
We provide a minimal counterexample to the correctness of an algorithm proposed by R. Tarjan for decomposing a graph by maximal clique separators. We also suggest a modification to that algorithm which not only corrects it but also retains its O(nm) time complexity.
متن کاملClique-decomposition revisited
The decomposition of graphs by clique-minimal separators is a common algorithmic tool, first introduced by Tarjan. Since it allows to cut a graph into smaller pieces, it can be applied to preprocess the graphs in the computation of many optimization problems. However, the best known clique-decomposition algorithms have respective O(nm)-time and O(n)-time complexity, that is prohibitive for larg...
متن کاملAn Introduction to Clique Minimal Separator Decomposition
This paper is a review which presents and explains the decomposition by clique minimal separators, which is a promising tool for representing and decomposing experimental data. The pace is leisurely, we give many examples and figures. Easy algorithms are provided to implement this decomposition. The historical and theoretical background is given, as well as sketches of proofs of the structural ...
متن کاملGreedy Clique Decomposition for Symbolic Satisfiability Solving
Motivated by the recent theoretical results regarding OBDD proof system, this paper applies a new variable grouping heuristic called greedy clique decomposition to symbolic satisfiability solving. Experimental results are compared against other state-of-the-art satisfiability solving tools, including Ebddres, Minisat, TTS and SSAT. We are able to show that with this new heuristic method, our im...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2018
ISSN: 0895-4801,1095-7146
DOI: 10.1137/16m1059837